Irregularities of Point Distribution Relative to Convex Polygons Iii
نویسنده
چکیده
The situation is somewhat different when the aligned rectangles are replaced by similar copies of a given convex polygon. More precisely, suppose that 0 is a distribution of N points in the unit square U ̄ [0, 1]#, treated as a torus. Suppose that AXU is a closed convex polygon of diameter less than 1 and with centre of gravity at the origin O. For every real number r satisfying 0% r% 1 and every angle θ satisfying 0% θ% 2π, let v ̄ θ(u) denote 0" # 1 ̄ 0 cos θ ®sin θ sin θ cos θ1 0u" u # 1 ,
منابع مشابه
On Irregularities of Distribution Iii
Dedicated to the memory of Gerold Wagner Abstract We study the L w -norm (2 < W < oo) of the discrepancy of a sequence of points in the unit cube relative to similar copies of a given convex polygon. In particular, we prove the rather surprising result that the estimates obtained have the same order of magnitude as the analogous question when the sequence of points is replaced by a set of point...
متن کاملUniformity and Irregularity
Introduction. The purpose of this report is to draw attention to some nontrivial connections between the ("continuous") theory of irregularities of distribution and discrete mathematics. The object of the theory of irregularities of distribution is to measure the uniformity (or nonuniformity) of sequences and point sets. For instance: how uniformly can an arbitrary set of N points in the unit c...
متن کاملOptimal Algorithms for Stabbing Polygons by Monotone Chains
In this paper we present optimal algorithms to compute monotone stabbers for convex polygons. More precisely, given a set of m convex polygons with n vertices in total we want to stab the polygons with an x-monotone polygonal chain such that each polygon is entered at its leftmost point and departed at its rightmost point. Since such a stabber does not exist in general, we study two related pro...
متن کاملDecompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993